Frequently Asked Questions in Polyhedral Computation

نویسنده

  • Komei Fukuda
چکیده

2 Convex Polyhedron 3 2.1 What is convex polytope/polyhedron? . . . . . . . . . . . . . . . . . . . . . . 3 2.2 What are the faces of a convex polytope/polyhedron? . . . . . . . . . . . . . . 3 2.3 What is the face lattice of a convex polytope . . . . . . . . . . . . . . . . . . . 4 2.4 What is a dual of a convex polytope? . . . . . . . . . . . . . . . . . . . . . . . 4 2.5 What is simplex? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.6 What is cube/hypercube/cross polytope? . . . . . . . . . . . . . . . . . . . . . 5 2.7 What is simple/simplicial polytope? . . . . . . . . . . . . . . . . . . . . . . . . 5 2.8 What is 0-1 polytope? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.9 What is the best upper bound of the numbers of k-dimensional faces of a dpolytope with n vertices? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.10 What is convex hull? What is the convex hull problem? . . . . . . . . . . . . . 6 2.11 What is the Minkowski-Weyl theorem for convex polyhedra? . . . . . . . . . 6 2.12 What is the vertex enumeration problem, and what is the facet enumeration problem? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Polyhedral Optimizations with Constant Loop Bounds in Finite State Space Computations

As processors gain in complexity and heterogeneity, compilers are asked to perform program transformations of ever-increasing complexity to effectively map an input program to the target hardware. It is critical to develop methods and tools to automatically assert the correctness of programs generated by such modern optimizing compilers. We present a framework to verify if two programs (one pos...

متن کامل

Matching Queries to Frequently Asked Questions: Search Functionality for the MRSA Web-Portal

As part of the long-term EUREGIO MRSA-net project a system was developed which enables health care workers and the general public to quickly find answers to their questions regarding the MRSA pathogen. This paper focuses on how these questions can be answered using Information Retrieval (IR) and Natural Language Processing (NLP) techniques on a Frequently-Asked-Questions-style (FAQ) database.

متن کامل

Frequently Asked Questions about Megafunds *

Since the publication of Fernandez, Stein, and Lo (2012) on using securitization techniques to raise funds from the private sector to support biomedical research, the MIT Laboratory for Financial Engineering (LFE) has received a number of stimulating comments and questions about these techniques. Rather than replying to each inquiry individually, we decided to respond via this “frequently asked...

متن کامل

A Hierarchy of Polyhedral Arrangements

iii Acknowledgments iv Chapter 1. A Hierarchy of Polyhedral Arrangements 1 1.1. Polyhedral Arrangements 1 1.2. Polyhedral Dissections 1 1.3. Polyhedral Complexes 5 1.4. Polyhedral Triangulations 8 1.5. A Hierarchy of Polyhedral Arrangements 9 Chapter 2. Computation on Polyhedral Arrangements 12 2.1. Bucket Method 12 2.2. Sage Code 13 2.3. Experiments 16 Chapter 3. Regular Triangulations 22 3.1....

متن کامل

Frequently Asked Questions in Bug Reports

Bug tracking systems play a central role in software development since they allow users and developers to submit and discuss bugs and new features. To better understand information and communication needs in bug tracking, we analysed what questions are asked in bug reports. We sampled 600 bug reports from the MOZILLA and ECLIPSE projects and located 947 questions in the reports. Next, we used a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998